3 A ug 2 00 9 GRAPHS WHOSE FLOW POLYNOMIALS HAVE ONLY INTEGRAL ROOTS
نویسنده
چکیده
We show if the flow polynomial of a bridgeless graph G has only integral roots, then G is the dual graph to a planar chordal graph. We also show that for 3-connected cubic graphs, the same conclusion holds under the weaker hypothesis that it has only real flow roots. Expressed in the language of matroid theory, this result says that the cographic matroids with only integral characteristic roots are the cycle matroids of planar chordal graphs.
منابع مشابه
Graphs whose flow polynomials have only integral roots
We show if the flow polynomial of a bridgeless graph G has only integral roots, then G is the dual graph to a planar chordal graph. We also show that for 3-connected cubic graphs, the same conclusion holds under the weaker hypothesis that it has only real flow roots. Expressed in the language of matroid theory, this result says that the cographic matroids with only integral characteristic roots...
متن کاملOn Graphs Having no Flow Roots in the Interval $(1, 2)$
For any graphG, letW (G) be the set of vertices inG of degrees larger than 3. We show that for any bridgeless graph G, if W (G) is dominated by some component of G−W (G), then F (G,λ) has no roots in (1, 2), where F (G,λ) is the flow polynomial of G. This result generalizes the known result that F (G,λ) has no roots in (1, 2) whenever |W (G)| 6 2. We also give some constructions to generate gra...
متن کاملNon-chordal graphs having integral-root chromatic polynomials II
It is known that the chromatic polynomial of any chordal graph has only integer roots. However, there also exist non-chordal graphs whose chromatic polynomials have only integer roots. Dmitriev asked in 1980 if for any integer p¿ 4, there exists a graph with chordless cycles of length p whose chromatic polynomial has only integer roots. This question has been given positive answers by Dong and ...
متن کاملNew families of graphs whose independence polynomials have only real roots
We describe an inductive means of constructing infinite families of graphs, every one of whose members G has independence polynomial I(G; x) having only real zeros. Consequently, such independence polynomials are logarithmically concave and unimodal.
متن کاملar X iv : 0 70 8 . 05 14 v 1 [ m at h . G T ] 3 A ug 2 00 7 Invariants of genus 2 mutants
Pairs of genus 2 mutant knots can have different Homfly polynomials, for example some 3-string satellites of Conway mutant pairs. We give examples which have different Kauffman 2-variable polynomials, answering a question raised by Dunfield et al in their study of genus 2 mutants. While pairs of genus 2 mutant knots have the same Jones polynomial, given from the Homfly polynomial by setting v =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009